Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
نویسندگان
چکیده
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level one. The solution-level population searches for the good solution in a given problem. The schema-level population searches for the good schemata in the former population. Our CGA performs effectively by exchanging genetic information between these populations. Also, we define Dynamic Constraint Satisfaction Problems as such dynamic environments. General CSPs are defined by two stochastic parameters: density and tightness, then, Dynamic CSPs are defined as a sequence of static constraint networks of General CSPs. Computational results on DCSPs confirm us the effectiveness of our approach.
منابع مشابه
A New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملA New Approach to Constraint Weight Learning for Variable Ordering in CSPs
A Constraint Satisfaction Problem (CSP) is a framework used for modeling and solving constrained problems. Treesearch algorithms like backtracking try to construct a solution to a CSP by selecting the variables of the problem one after another. The order in which these algorithm select the variables potentially have significant impact on the search performance. Various heuristics have been prop...
متن کاملSolving Temporal Constraints in Real Time and in a Dynamic Environment
In this paper we will present a study of different resolution techniques for solving Constraint Satisfaction Problems (CSP) in the case of temporal constraints. This later problem is called Temporal Constraint Satisfaction Problem (TCSP). We will mainly focus here on solving TCSPs in real time and in a dynamic environment. Indeed, addressing these two issues is very relevant for many real world...
متن کامل